Lower Bounds for the Maximum Number of Solutions Generated by the Simplex Method
نویسندگان
چکیده
Kitahara and Mizuno [3] get upper bounds for the maximum number of different basic feasible solutions generated by Dantzig’s simplex method. In this paper, we obtain lower bounds of the maximum number. Part of the results in this paper are shown in Kitahara and Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty’s LP and get a lower bound. In this paper, we explain and prove the properties of the variant more precisely. We also show a new lower bound by using a simple example of LP.
منابع مشابه
A Strongly Polynomial Simplex Method for Totally Unimodular LP
Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method for linear programming (LP). In this paper, we combine results of Kitahara and Mizuno and Tardos’s strongly polynomial algorithm, and propose an algorithm for solving a standard form LP problem. The algorithm solves polynomial number of artificial LP problems by the simplex method with Dantzi...
متن کاملKlee-Minty's LP and upper bounds for Dantzig's simplex method
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic feasible solutions generated by Dantzig’s simplex method. The size of the bounds highly depends on the ratio between the maximum and minimum values of all the positive elements of basic feasible solutions. In this paper, we show some relations between the ratio and the number of iterations by using an example of L...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملOn the number of solutions generated by the dual simplex method
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with the most negative pivoting rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (2010) for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.
متن کاملA Proof by the Simplex Method for the Diameter of a (0,1)-Polytope
Naddef [3] shows that the Hirsch conjecture is true for (0,1)-polytopes by proving that the diameter of any (0, 1)-polytope in d-dimensional Euclidean space is at most d. In this short paper, we give a simple proof for the diameter. The proof is based on the number of solutions generated by the simplex method for a linear programming problem. Our work is motivated by Kitahara and Mizuno [2], in...
متن کامل